38 research outputs found
A Canonical Model Construction for Iteration-Free PDL with Intersection
We study the axiomatisability of the iteration-free fragment of Propositional
Dynamic Logic with Intersection and Tests. The combination of program
composition, intersection and tests makes its proof-theory rather difficult. We
develop a normal form for formulae which minimises the interaction between
these operators, as well as a refined canonical model construction. From these
we derive an axiom system and a proof of its strong completeness.Comment: In Proceedings GandALF 2016, arXiv:1609.0364
The Fixpoint-Iteration Algorithm for Parity Games
It is known that the model checking problem for the modal mu-calculus reduces
to the problem of solving a parity game and vice-versa. The latter is realised
by the Walukiewicz formulas which are satisfied by a node in a parity game iff
player 0 wins the game from this node. Thus, they define her winning region,
and any model checking algorithm for the modal mu-calculus, suitably
specialised to the Walukiewicz formulas, yields an algorithm for solving parity
games. In this paper we study the effect of employing the most straight-forward
mu-calculus model checking algorithm: fixpoint iteration. This is also one of
the few algorithms, if not the only one, that were not originally devised for
parity game solving already. While an empirical study quickly shows that this
does not yield an algorithm that works well in practice, it is interesting from
a theoretical point for two reasons: first, it is exponential on virtually all
families of games that were designed as lower bounds for very particular
algorithms suggesting that fixpoint iteration is connected to all those.
Second, fixpoint iteration does not compute positional winning strategies. Note
that the Walukiewicz formulas only define winning regions; some additional work
is needed in order to make this algorithm compute winning strategies. We show
that these are particular exponential-space strategies which we call
eventually-positional, and we show how positional ones can be extracted from
them.Comment: In Proceedings GandALF 2014, arXiv:1408.556
Model Checking Timed Recursive CTL
We introduce Timed Recursive CTL, a merger of two extensions of the well-known branching-time logic CTL: Timed CTL is interpreted over real-time systems like timed automata; Recursive CTL introduces a powerful recursion operator which takes the expressiveness of this logic CTL well beyond that of regular properties. The result is an expressive logic for real-time properties. We show that its model checking problem is decidable over timed automata, namely 2-EXPTIME-complete
Temporal Logic with Recursion
We introduce extensions of the standard temporal logics CTL and LTL with a recursion operator that takes propositional arguments. Unlike other proposals for modal fixpoint logics of high expressive power, we obtain logics that retain some of the appealing pragmatic advantages of CTL and LTL, yet have expressive power beyond that of the modal ?-calculus or MSO. We advocate these logics by showing how the recursion operator can be used to express interesting non-regular properties. We also study decidability and complexity issues of the standard decision problems
The Tail-Recursive Fragment of Timed Recursive CTL
Timed Recursive CTL (TRCTL) was recently proposed as a merger of two extensions of the well-known branching-time logic CTL: Timed CTL on one hand is interpreted over real-time systems like timed automata, and Recursive CTL (RecCTL) on the other hand obtains high expressiveness through the introduction of a recursion operator. Model checking for the resulting logic is known to be 2-EXPTIME-complete.
The aim of this paper is to investigate the possibility to obtain a fragment of lower complexity without losing too much expressive power. It is obtained by a syntactic property called "tail-recursiveness" that restricts the way that recursive formulas can be built. This restriction is known to decrease the complexity of model checking by half an exponential in the untimed setting. We show that this also works in the real-time world: model checking for the tail-recursive fragment of TRCTL is EXPSPACE-complete. The upper bound is obtained by a standard untiming construction via region graphs, and rests on the known complexity of tail-recursive fragments of higher-order modal logics. The lower bound is established by a reduction from a suitable tiling problem
Verifying And Interpreting Neural Networks using Finite Automata
Verifying properties and interpreting the behaviour of deep neural networks
(DNN) is an important task given their ubiquitous use in applications,
including safety-critical ones, and their blackbox nature. We propose an
automata-theoric approach to tackling problems arising in DNN analysis. We show
that the input-output behaviour of a DNN can be captured precisely by a
(special) weak B\"uchi automaton of exponential size. We show how these can be
used to address common verification and interpretation tasks like adversarial
robustness, minimum sufficient reasons etc. We report on a proof-of-concept
implementation translating DNN to automata on finite words for better
efficiency at the cost of losing precision in analysis